On Randomized Broadcasting and Gossiping in Radio Networks
نویسندگان
چکیده
This paper has two parts. In the first part we give an alternative (and much simpler) proof for the best known lower bound of Ω(D log (N/D)) for randomized broadcasting in radio networks with unknown topology. In the second part we give an O(N log N)-time randomized algorithm for gossiping in such radio networks. This is an improvement over the fastest previously known algorithm that works in time O(N log N).
منابع مشابه
Gossiping with Bounded Size Messages in ad hoc Radio Networks
We study deterministic algorithms for the gossiping problem in ad hoc radio networks under the assumption that each combined message contains at most b(n) single messages or bits of auxiliary information, where b is an integer function and n is the number of nodes in the network. We term such a restricted gossiping problem b(n)-gossiping. We show that √ n-gossiping in an ad hoc radio network on...
متن کاملFaster Centralized Communication in Radio Networks
We study the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed based on full knowledge about the size and the topology of the network. We show that gossiping can be completed in O(D+ Δ log n logΔ−log log n ) time units in any ra...
متن کاملFast Broadcasting and Gossiping in Radio Networks
We establish an O(n log2 n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. This nearly matches the known lower bound of (n logn). The fastest previously known algorithm for this problem works in time O(n3=2). Using our broadcasting algorithm, we develop an O(n3=2 log2 n) algorithm for gossiping in the same network model.
متن کاملA Randomized Algorithm for Gossiping in Radio Networks
The two classical problems of disseminating information in computer networks are broadcasting and gossiping. In broadcasting, we want to distribute a given message from a distinguished source node to all other nodes in the network. In gossiping, each node v in the network initially contains a message mv, and we wish to distribute each message mv to all nodes in the network. In both problems, we...
متن کاملInformation dissemination in unknown radio networks with large labels
We consider the problems of deterministic broadcasting and gossiping in completely unknown ad-hoc radio networks. We assume that nothing is known to the nodes about the topology or even the size of the network, n, except that n > 1. Protocols for vanilla model, when n is known, may be run for increasingly larger estimates 2 on the size of the network, but one cannot determine when such a protoc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002